Constraint logic programming

Results: 401



#Item
231Mathematical optimization / Operations research / Constraint programming / Logic in computer science / Electronic design automation / Satisfiability Modulo Theories / Solver / Nl / AMPL / Theoretical computer science / Applied mathematics / Mathematics

technology from seed Verifying Optimizations using SMT Solvers Nuno Lopes

Add to Reading List

Source URL: llvm.org

Language: English - Date: 2013-12-16 20:46:26
232Mathematics / Applied mathematics / Simplex algorithm / Linear programming / Slack variable / Constraint logic programming / Constraint / Least squares / Hybrid algorithm / Mathematical optimization / Constraint programming / Operations research

The Cassowary Linear Arithmetic Constraint Solving Algorithm: Interface and Implementation Greg J. Badros Alan Borning

Add to Reading List

Source URL: constraints.cs.washington.edu

Language: English - Date: 2000-05-10 17:41:18
233Artificial intelligence / Lagrange multiplier / Constraint programming / Constraint satisfaction / Constraint logic programming

Constraint Satisfaction Modules A Methodology for Analog Circuit Design Piotr Mitros [removed] Massachusetts Institute of Technology

Add to Reading List

Source URL: mitros.org

Language: English - Date: 2008-05-17 03:27:14
234Point on plane closest to origin / Constraint programming / Constraint satisfaction / Constraint logic programming

Constraint Satisfaction Modules A Methodology for Analog Circuit Design Piotr Mitros [removed] Massachusetts Institute of Technology

Add to Reading List

Source URL: mitros.org

Language: English - Date: 2008-05-17 03:41:17
235Declarative programming / Constraint programming / Reasoning / Charles Sanders Peirce / Epistemology / Abductive logic programming / Constraint logic programming / Schedule / Prolog / Logic programming / Software engineering / Science

From Logic Programming 22 July 99-AMAI

Add to Reading List

Source URL: www.doc.ic.ac.uk

Language: English - Date: 2006-07-10 05:28:49
236Formal methods / Automated theorem proving / Mathematical logic / Constraint programming / SPASS / Isabelle / Satisfiability Modulo Theories / Mathematical proof / Vampire / Theoretical computer science / Mathematics / Applied mathematics

PDF Document

Add to Reading List

Source URL: isabelle.in.tum.de

Language: English - Date: 2014-08-27 06:04:04
237Mathematics / Model theory / Logic in computer science / Electronic design automation / NP-complete problems / Satisfiability Modulo Theories / Boolean satisfiability problem / Constraint satisfaction problem / Symbol / Theoretical computer science / Constraint programming / Mathematical logic

Software Tools for Technology Transfer manuscript No. (will be inserted by the editor) Don’t care in SMT⋆ Building flexible yet efficient abstraction/refinement solvers Andreas Bauer1 , Martin Leucker2 , Christian Sc

Add to Reading List

Source URL: www.immerundewig.at

Language: English - Date: 2009-10-01 20:34:14
238Boolean algebra / Automated theorem proving / Constraint programming / Mathematical logic / Diagrams / Binary decision diagram / DPLL algorithm / Boolean satisfiability problem / Resolution / Theoretical computer science / Mathematics / Applied mathematics

Refutation-Complete Binary Decision Diagrams Scott P. Sanner Department of Computer Science University of Toronto Toronto, ON M5S 3G4

Add to Reading List

Source URL: users.cecs.anu.edu.au

Language: English - Date: 2004-05-05 19:58:06
239Propositional calculus / Boolean algebra / Constraint programming / Formal languages / Model theory / Boolean satisfiability problem / String / Propositional formula / Function / Mathematics / Logic / Mathematical logic

Propositional Encoding of Constraints over Tree-Shaped Data Johannes Waldmann and Alexander Bau HTWK Leipzig, Germany {waldmann,abau}@imn.htwk-leipzig.de

Add to Reading List

Source URL: www.imn.htwk-leipzig.de

Language: English - Date: 2013-05-22 03:33:16
240Mathematics / Logic in computer science / Electronic design automation / Formal methods / NP-complete problems / Satisfiability Modulo Theories / Boolean satisfiability problem / Constraint satisfaction problem / Solver / Theoretical computer science / Constraint programming / Applied mathematics

Don’t care in SMT—Building flexible yet efficient abstraction/refinement solvers1 Andreas Bauer∗ , Martin Leucker∗∗, Christian Schallhart∗∗, Michael Tautschnig∗∗ ∗ ∗∗

Add to Reading List

Source URL: www.immerundewig.at

Language: English - Date: 2007-11-26 20:10:39
UPDATE